Logic in computer science - PDFSEARCH.IO - Document Search Engine

Logic in computer science
Results: 2713

#	Item
761	Distributed Games and Strategies Glynn Winskel The notion of deterministic/nondeterministic strategy is potentially as fundamental as the notion of function/relation. A broad enough notion of strategy must be planted fir Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2015-03-17 07:19:58 Logic in computer science Computer science Applied mathematics Denotational semantics Petri net Determinacy Strategy Models of computation Theoretical computer science Concurrency
762	Logic and the Methodology of Science Autumn 2002 Preliminary Exam Draft August 23, Let ϕe be the eth partial recursive function in some standard enumeration, and let We be the domain of ϕe ). Show that there is Add to Reading List Source URL: logic.berkeley.edu Language: English - Date: 2014-08-24 16:43:20 Theory of computation Theoretical computer science Metalogic Model theory Recursively enumerable set Constructible universe Presentation of a group Ordinal number Ω-consistent theory Mathematics Mathematical logic Computability theory
763	INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Project-Team Gallium Programming languages, types, compilation and proofs Paris - Rocquencourt Add to Reading List Source URL: raweb.inria.fr Language: English - Date: 2011-02-28 06:23:38 Functional languages Type theory Procedural programming languages Logic in computer science Cross-platform software Type system OCaml Coq ML Software engineering Computing Programming language theory
764	Under consideration for publication in J. Functional Programming 1 The Arrow Calculus Sam Lindley, Philip Wadler, and Jeremy Yallop Add to Reading List Source URL: groups.inf.ed.ac.uk Language: English - Date: 2009-10-19 06:42:21 Lambda calculus Computability theory Fixed-point combinator Arrow Quiver Natural deduction Combinatory logic Theoretical computer science Mathematics Applied mathematics
765	February 23, Domain Decomposition: Using Massively Parallel Architectures In order to make efficient use of the present-day massively parallel architectures, we have Add to Reading List Source URL: kiwi.atmos.colostate.edu Language: English - Date: 2007-11-17 12:15:56 Parallel computing Algorithm Mathematical logic Theoretical computer science Geodesic grid Message Passing Interface Global climate model Atmospheric sciences Climatology Meteorology
766	CSL-LICSJuly 15, 2014 CSL-LICS 2014 Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2014-07-23 09:38:11 Standards organizations Institute of Electrical and Electronics Engineers Engineering Science IEEE Symposium on Logic in Computer Science Logic in computer science International nongovernmental organizations
767	Presburger Arithmetic and Pseudo-Recursive Saturation David Llewellyn-Jones School of Mathematics and Statistics The University of Birmingham Edgbaston, Birmingham, B15 2TT, U.K. Add to Reading List Source URL: www.flypig.co.uk Language: English - Date: 2015-04-13 15:49:07 Logic in computer science Proof theory Mathematics Quantifier elimination Presburger arithmetic Mathematical logic Model theory Logic
768	Introduction to Computing: Explorations in Language, Logic, and Machines Add to Reading List Source URL: www.computingbook.org Language: English - Date: 2011-08-19 11:52:17 Computer science Turing machine Theory of computation Theoretical computer science Models of computation Busy beaver Computability Turing Recursive transition network Software engineering Computing Computability theory
769	Proofs and Refutations, and Z3 Leonardo de Moura and Nikolaj Bjørner Microsoft Research Abstract Z3 [3] is a state-of-the-art Satisfiability Modulo Theories (SMT) solver freely available from Microsoft Research. It solv Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2009-07-21 19:11:06 Formal methods Metalogic Logic in computer science Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Conjunctive normal form Mathematical proof Mathematics Theoretical computer science Logic
770	Software Engineering and Automated Deduction Willem Visser Nikolaj Bjørner Natarajan Shankar Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-05-07 12:02:12 Formal methods Automated theorem proving Logic in computer science NP-complete problems Model checking Satisfiability Modulo Theories Boolean satisfiability problem KeY First-order logic Theoretical computer science Logic Mathematical logic

UPDATE